Bounds on the Arithmetic-Geometric Index
نویسندگان
چکیده
The concept of arithmetic-geometric index was recently introduced in chemical graph theory, but it has proven to be useful from both a theoretical and practical point view. aim this paper is obtain new bounds the characterize extremal graphs with respect them. Several are based on other indices, such as second variable Zagreb or general atom-bond connectivity index), some them involve parameters, number edges, maximum degree, minimum degree graph. In most bounds, for which equality attained regular biregular, star graphs.
منابع مشابه
Some remarks on the arithmetic-geometric index
Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.
متن کاملOn Second Geometric-Arithmetic Index of Graphs
The concept of geometric-arithmetic indices (GA) was put forward in chemical graph theory very recently. In spite of this, several works have already appeared dealing with these indices. In this paper we present lower and upper bounds on the second geometric-arithmetic index (GA2) and characterize the extremal graphs. Moreover, we establish Nordhaus-Gaddum-type results for GA2.
متن کاملOn Third Geometric-Arithmetic Index of Graphs
Continuing the work K. C. Das, I. Gutman, B. Furtula, On second geometric-arithmetic index of graphs, Iran. J. Math Chem., 1(2) (2010) 17-28, in this paper we present lower and upper bounds on the third geometric-arithmetic index GA3 and characterize the extremal graphs. Moreover, we give Nordhaus-Gaddum-type result for GA3.
متن کاملOn the total version of geometric-arithmetic index
The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2021
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym13040689